A Blockchain Consensus Protocol Based on Dedicated Time-Memory-Data Trade-Off
نویسندگان
چکیده
منابع مشابه
Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus
The decentralized cryptocurrency Bitcoin has experienced great success but also encountered many challenges. One of the challenges has been the long confirmation time. Another challenge is the lack of incentives at certain steps of the protocol, raising concerns for transaction withholding, selfish mining, etc. To address these challenges, we propose Solida, a decentralized blockchain protocol ...
متن کاملA Review on Consensus Algorithms in Blockchain
Block chain technology is a decentralized data storage structure based on a chain of data blocks that are related to each other. Block chain saves new blocks in the ledger without trusting intermediaries through a competitive or voting mechanism. Due to the chain structure or the graph between each block with its previous blocks, it is impossible to change blocking data. Block chain architectur...
متن کاملA New Cryptanalytic Time/Memory/Data Trade-off Algorithm
In 1980, Hellman introduced a time/memory trade-off (TMTO) algorithm satisfying the TMTO curve TM = N, where T is the online time, M is the memory and N is the size of the search space. Later work by Biryukov-Shamir incorporated multiple data to obtain the curve TMD = N, where D is the number of data points. In this paper, we describe a new table structure obtained by combining Hellman’s struct...
متن کاملTime-Memory-Data Trade-Off Attack on Stream Ciphers Based on Maiorana-McFarland Functions
In this paper, we present the time-memory-data (TMD) trade-off attack on stream ciphers filter function generators and filter cominers based on Maiorana-McFarland functions. This can be considered as a generalization of the time-memory-data trade-off attack of Mihaljevic and Imai on Toyocrypt. First, we substitute the filter function in Toyocrypt (which has the same size as the LFSR) with a gen...
متن کاملA cryptanalytic time-memory trade-off
A&M&-A probabilistic method is presented wtdcb cryptanalyzes any N key cryptosystem in N2i3 operations with N2j3 words of memory (average vale) after a precomputatioo which requires N operations. If tke precomputation cao be performed in a reasooable time period (e.g* several years), the additional computation reqoired to recover e& key compares very favorably wltb the N operations reqdred by a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3013199